A branch-and-price algorithm for the long-term home care scheduling problem
نویسندگان
چکیده
In several countries, home care is provided for certain citizens living at home. The long-term home care scheduling problem is to generate work plans such that a high quality of service is maintained, the work hours of the employees are respected, and the overall cost is kept as low as possible. We propose a branchand-price algorithm for the long-term home care scheduling problem. The pricing problem generates a one-day plan for an employee, and the master problem merges the plans with respect to regularity constraints. The method is capable of generating plans with up to 44 visits during one week.
منابع مشابه
A Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کاملStochastic Short-Term Hydro-Thermal Scheduling Based on Mixed Integer Programming with Volatile Wind Power Generation
This study addresses a stochastic structure for generation companies (GenCoʼs) that participate in hydro-thermal self-scheduling with a wind power plant on short-term scheduling for simultaneous reserve energy and energy market. In stochastic scheduling of HTSS with a wind power plant, in addition to various types of uncertainties such as energy price, spinning /non-spinning reserve prices, unc...
متن کاملAn imperialist competitive algorithm for solving the production scheduling problem in open pit mine
Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کامل